An Adaptive Approach to Detecting Black and Gray Hole Attacks in Ad Hoc Network.

Design and Construction of a Prototype Secure Wireless Mesh Network Testbed.

Ziv%2DZakai bounds for time delay estimation with frequency hopping and multicarrier signals in wideband random channels.

Study on comprehensive evaluation method of team capability based on DEA.

Comparison and analysis for the calculation methods of fractal dimension of river system.

Learning to rank audience for behavioral targeting.

Reversely Anisotropic Quad%2Ddominant Remeshing.

Reversely Anisotropic Quad%2Ddominant Remeshing.



ExSearch a novel vertical search engine for online barter business.

An Intelligent Optimization Algorithm for Demand Fulfillment and ATP in Advanced Planning System.

Automatic Population and Updating of a Semantic Wiki%2Dbased Configuration Management Database.

Synthesizing Novel Dimension Reduction Algorithms in Matrix Trace Oriented Optimization Framework.

Security in Wireless Mesh Networks Challenges and Solutions.



A Markov chain model for integrating behavioral targeting into contextual advertising.

Probabilistic latent semantic user segmentation for behavioral targeted advertising.

Immediate user performances with touch Chinese text entry solutions on handheld devices.
“Immediate usability ” is more important for mobile text entry solutions [7]. We compared immediate user performance of four touch Chinese text entry solutions on mobile devices including two Chinese handwriting recognition (HWR: full screen and 3-box) and two pinyin virtual keyboard (VKB: consonant plus vowel and QWERTY) solutions with novice users. It was found that users make more errors with Chinese HWR solutions than VKB solutions although there are no significant differences between the two solutions in each category. Users are significantly slower with the consonant plus vowel pinyin keyboard than the other three solutions although the consonant plus vowel keyboard is better on the measure of key stroke per character (KSPC).
CLHQS Hierarchical Query Suggestion by Mining Clickthrough Log.

User experience evaluation of Post%2DTraumatic Mobile Service a case study.

CLHQS Hierarchical Query Suggestion by Mining Clickthrough Log.

Straightforward Feature Selection for Scalable Latent Semantic Indexing.

Temporal query substitution for ad search.

A probabilistic model based approach for blended search.

Search result re%2Dranking based on gap between search queries and social tags.

Identifying vertical search intention of query through social tagging propagation.

How much can behavioral targeting help online advertising%3F

Text Streaming Model.
Text representation plays a crucial role in classical text mining, where the primary focus was on static text. Nevertheless, well-studied static text representations including TFIDF are not optimized for non-stationary streams of information such as news, discussion board messages, and blogs. We therefore introduce a new temporal representation for text streams based on bursty features. Our bursty text representation differs significantly from traditional schemes in that it 1) dynamically represents documents over time, 2) amplifies a feature in proportional to its burstiness at any point in time, and 3) is topic independent. Our bursty text representation model was evaluated against a classical bagof-words text representation on the task of clustering TDT3 topical text streams. It was shown to consistently yield more cohesive clusters in terms of cluster purity and cluster/class entropies. This new temporal bursty text representation can be extended to most text mining tasks involving a temporal dimension, such as modeling of online blog pages. 1
Topic Detection and Tracking.
Topic Detection and Tracking (TDT) refers to automatic techniques for finding topically related material in streams of data (e.g., newswire and broadcast news). Work on TDT began about a year ago, is now expanding, and will be a regular feature at future Broadcast News workshops. INTRODUCTION  Thanks to DARPA and NSF funding for research on critical speech and text processing problems plus NIST sponsorship of objective performance evaluations, the research community has been very successful in recent years in creating critical new component technologies. These include, for example, increasingly accurate and robust techniques for converting speech to text in Hub 4, for finding documents that match ad hoc queries in TREC, and for finding named entities in MUC. These technologies enable a wide variety of important applications, and their successes permit new research challenges to be undertaken. Topic Detection and Tracking (TDT) is an important, relatively new challenge. Work on TDT bega...
An online blog reading system by topic clustering and personalized ranking.

The effects of parameter variation on the gaits of passive walking models simulations and experiments.

Group%2DBased Trust Model in P2P System Based on Trusted Computing.

Research on the Application of UML in Software Architecture Modeling.

Learning the Latent Semantic Space for Ranking in Text Retrieval.

TOFA Trace Oriented Feature Analysis in Text Categorization.

Web Query Prediction by Unifying Model.

Analysis and Improvement of an Anonymity Scheme for P2P Reputation Systems.

An Optimization Method for Real%2DTime Natural Phenomena Simulation on WinCE Platform.

Local Word Bag Model for Text Categorization.

Causal relation of queries from temporal logs.

Query topic detection for reformulation.

Statistical Attack Resilient Data Hiding.

Security and Robustness Enhancement for Image Data Hiding.

A Complete Multiagent Framework for Robust and Adaptable Dynamic Job Shop Scheduling.

Bi%2Ddirectional Passenger Counting on Crowded Situation Based on Sequence Color Images.

A Novel Scalable Algorithm for Supervised Subspace Learning.
Subspace learning approaches aim to discover important statistical distribution on lower dimensions for high dimensional data. Methods such as Principal Component Analysis (PCA) do not make use of the class information, and Linear Discriminant Analysis (LDA) could not be performed efficiently in a scalable way. In this paper, we propose a novel highly scalable supervised subspace learning algorithm called as Supervised Kampong Measure (SKM). It assigns data points as close as possible to their corresponding class mean, simultaneously assigns data points to be as far as possible from the other class means in the transformed lower dimensional subspace. Theoretical derivation shows that our algorithm is not limited by the number of classes or the singularity problem faced by LDA. Furthermore, our algorithm can be executed in an incremental manner in which learning is done in an online fashion as data streams are received. Experimental results on several datasets, including a very large text data set RCV1, show the outstanding performance of our proposed algorithm on classification problems as compared to PCA, LDA and a popular feature selection approach, Information Gain (IG). 1.
Similarity of Temporal Query Logs Based on ARIMA Model.

Similarity of Temporal Query Logs Based on ARIMA Model.

Similarity of Temporal Query Logs Based on ARIMA Model.

An Effective System for Optical Microscopy Cell Image Segmentation

Worst Case Attack on Quantization Based Data Hiding.

Mining Adaptive Ratio Rules from Distributed Data Sources.
Abstract. Different from traditional association-rule mining, a new paradigm called Ratio Rule (RR) was proposed recently. Ratio rules are aimed at capturing the quantitative association knowledge, We extend this framework to mining ratio rules from distributed and dynamic data sources. This is a novel and challenging problem. The traditional techniques used for ratio rule mining is an eigen-system analysis which can often fall victim to noise. This has limited the application of ratio rule mining greatly. The distributed data sources impose additional constraints for the mining procedure to be robust in the presence of noise, because it is difficult to clean all the data sources in real time in real-world tasks. In addition, the traditional batch methods for ratio rule mining cannot cope with dynamic data. In this paper, we propose an integrated method to mining ratio rules from distributed and changing data sources, by first mining the ratio rules from each data source separately through a novel robust and adaptive one-pass algorithm (which is called Robust and Adaptive Ratio Rule (RARR)), and then integrating the rules of each data source in a simple probabilistic model. In this way, we can acquire the global rules from all the local information sources adaptively. We show that the RARR technique can converge to a fixed point and is robust as well. Moreover, the integration of rules is efficient
Effective and Efficient Dimensionality Reduction for Large%2DScale and Streaming Data Preprocessing.
Abstract—Dimensionality reduction is an essential data preprocessing technique for large-scale and streaming data classification tasks. It can be used to improve both the efficiency and the effectiveness of classifiers. Traditional dimensionality reduction approaches fall into two categories: Feature Extraction and Feature Selection. Techniques in the feature extraction category are typically more effective than those in feature selection category. However, they may break down when processing large-scale data sets or data streams due to their high computational complexities. Similarly, the solutions provided by the feature selection approaches are mostly solved by greedy strategies and, hence, are not ensured to be optimal according to optimized criteria. In this paper, we give an overview of the popularly used feature extraction and selection algorithms under a unified framework. Moreover, we propose two novel dimensionality reduction algorithms based on the Orthogonal Centroid algorithm (OC). The first is an Incremental OC (IOC) algorithm for feature extraction. The second algorithm is an Orthogonal Centroid Feature Selection (OCFS) method which can provide optimal solutions according to the OC criterion. Both are designed under the same optimization criterion. Experiments on Reuters Corpus Volume-1 data set and some public large-scale text data sets indicate that the two algorithms are favorable in terms of their effectiveness and efficiency when compared with other state-of-the-art algorithms. Index Terms—Feature extraction, feature selection, orthogonal centroid algorithm. 1
A scalable supervised algorithm for dimensionality reduction on streaming data.

A Similarity Reinforcement Algorithm for Heterogeneous Web Pages.

Supervised Semi%2Ddefinite Embedding for Email Data Cleaning and Visualization.

A Fingerprint Matching Algorithm Based On Delaunay Triangulation Net.

Text Representation From Vector to Tensor.

Supervised semi%2Ddefinite embedding for image manifolds.

Bathroom Activity Monitoring Based on Sound.

OCFS optimal orthogonal centroid feature selection for text categorization.
ABSTRACT 1 Text categorization is an important research area in many Information Retrieval (IR) applications. To save the storage space and computation time in text categorization, efficient and effective algorithms for reducing the data before analysis are highly desired. Traditional techniques for this purpose can generally be classified into feature extraction and feature selection. Because of efficiency, the latter is more suitable for text data such as web documents. However, many popular feature selection techniques such as Information Gain (IG) and 2 χ-test (CHI) are all greedy in nature and thus may not be optimal according to some criterion. Moreover, the performance of these greedy methods may be deteriorated when the reserved data dimension is extremely low. In this paper, we propose an efficient optimal feature selection algorithm by optimizing the objective function of Orthogonal Centroid (OC) subspace learning algorithm in a discrete solution space, called Orthogonal Centroid Feature Selection (OCFS). Experiments on 20 Newsgroups (20NG), Reuters Corpus Volume 1 (RCV1) and Open Directory Project (ODP) data show that OCFS is consistently better than IG and CHI with smaller computation time especially when the reduced dimension is extremely small.
TCQ%2Dbased quantizer design for data hiding in images.

Learning similarity measures in non%2Dorthogonal space.
Many machine learning and data mining algorithms crucially rely on the similarity metrics. The Cosine similarity, which calculates the inner product of two normalized feature vectors, is one of the most commonly used similarity measures. However, in many practical tasks such as text categorization and document clustering, the Cosine similarity is calculated under the assumption that the input space is an orthogonal space which usually could not be satisfied due to synonymy and polysemy. Various algorithms such as Latent Semantic Indexing (LSI) were used to solve this problem by projecting the original data into an orthogonal space. However LSI also suffered from the high computational cost and data sparseness. These shortcomings led to increases in computation time and storage requirements for large scale realistic data. In this paper, we propose a novel and effective similarity
Online Supervised Learning for Digital Library.

Non%2Duniform quantizer design for image data hiding.

Vector%2Dquantization%2Dbased scheme for data embedding for images.

